Growth of Self-Similar Graphs
نویسنده
چکیده
Locally finite self-similar graphs with bounded geometry and without bounded geometry as well as non-locally finite self-similar graphs are characterized by the structure of their cell graphs. Geometric properties concerning the volume growth and distances in cell graphs are discussed. The length scaling factor and the volume scaling factor can be defined similarly to the corresponding parameters of continuous self-similar sets. There are different notions of growth dimensions of graphs. For a rather general class of self-similar graphs, it is proved that all these dimensions coincide and that they can be calculated in the same way as the Hausdorff dimension of continuous self-similar fractals: dim X 1⁄4 log log : 2004 Wiley Periodicals, Inc. J Graph Theory 45: 224–239, 2004
منابع مشابه
Fe b 20 02 GROWTH OF SELF - SIMILAR GRAPHS
Geometric properties of self-similar graphs concerning their volume growth and distances in certain finite subgraphs are discussed. The length scaling factor ν and the volume scaling factor µ can be defined similarly to the corresponding parameters of continuous self-similar sets. There are different notions of growth dimensions of graphs. For a rather general class of self-similar graphs it is...
متن کاملOn a family of Schreier graphs of intermediate growth associated with a self-similar group
For every infinite sequence ω = x1x2 . . ., with xi ∈ {0, 1}, we construct an infinite 4-regular graph Xω. These graphs are precisely the Schreier graphs of the action of a certain self-similar group on the space {0, 1}∞. We solve the isomorphism and local isomorphism problems for these graphs, and determine their automorphism groups. Finally, we prove that all graphs Xω have intermediate growth.
متن کاملA Bernstein Type Theorem for Self-similar Shrinkers
In this note, we prove that smooth self-shrinkers in R, that are entire graphs, are hyperplanes. Previously Ecker and Huisken showed that smooth self-shrinkers, that are entire graphs and have at most polynomial growth, are hyperplanes. The point of this note is that no growth assumption at infinity is needed.
متن کاملEnumeration of matchings in families of self-similar graphs
Abstract. The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph parameters of this type in connection with self-similar, fractal-like graphs, we study the asymptotic behavior of the number of matchings in families of self-similar graphs that are constructed by a very gene...
متن کاملWiener Index of Graphs in Terms of Eccentricities
The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 2004